Logic of agreement: foundations, semantic system and proof theory
نویسندگان
چکیده
In this paper a multi-valued propositional logic logic of agreement in terms of its model theory and inference system is presented. This formal system is the natural consequence of a new way to approach concepts as commonsense knowledge, uncertainty and approximate reasoning the point of view of agreement. Particularly, it is discussed a possible extension of the Classical Theory of Sets based on the idea that, instead of trying to conceptualize sets as “fuzzy” or “vague” entities, it is more adequate to define membership as the result of a partial agreement among a group of individual agents. Furthermore, it is shown that the concept of agreement provides a framework for the development of a formal and sound explanation for concepts (e.g. fuzzy sets) which lack formal semantics. According to the definition of agreement, an individual agent agrees or not with the fact that an object possesses a certain property. A clear distinction is then established, between an individual agent to whom deciding whether an element belongs to a set is just a yes or no matter and a commonsensical gent the one who interprets the knowledge shared by a certain group of people. Finally, the logic of agreement is presented and discussed. As it is assumed the existence of several individual agents, the semantic system is based on the perspective that each individual agent defines her/his own conceptualization of reality. So the semantics of the logic of agreement can be seen as being similar to a semantics of possible worlds, one for each individual agent. The proof theory is an extension of a natural deduction system, using supported formulas and incorporating only inference rules. Moreover, the soundness and completeness of the logic of agreement are also presented.
منابع مشابه
Symmetry motivates a new consistent fragment of NF and an extension of NF with semantic motivation
A sequence of theories of sets and classes is presented, indexed by a natural number parameter k. The criterion for determining which classes are sets has to do with symmetry. The theories with k ≥ 2 are shown to entail Quine’s New Foundations, which is interesting as the criteria for sethood do not involved typed set theory or syntax of formulas. The theories with k = 0, 1 are shown to be cons...
متن کاملSpeciication and Proof in Membership Equational Logic
This paper is part of a long term eeort to increase expres-siveness of algebraic speciication languages while at the same time having a simple semantic basis on which eecient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, where they have been eeciently implemented. M...
متن کاملPOWERSET OPERATOR FOUNDATIONS FOR CATALG FUZZY SET THEORIES
The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage of (fuzzy) sets called forward and backward powerset operators. Motivated by an open question of S. E. Rodabaugh, we construct a monad on the category of sets, the algebras of which generate the fixed-basis forward powerset operator of L. A. Zadeh. On the next step, w...
متن کاملIntuitionistic Type Theory
Intuitionistic Type Theory (also Constructive Type Theory or Martin-Löf Type Theory) is a formal logical system and philosophical foundation for constructive mathematics (link). It is a fullscale system which aims to play a similar role for constructive mathematics as Zermelo-Fraenkel Set Theory (link) does for classical mathematics. It is based on the propositions-as-types principle and clarif...
متن کاملProof - Checking a Data Link
A data link protocol developed and used by Philips Electronics is modeled and veriied using I/O automata theory. Correctness is computer-checked with the Coq proof development system. AMS Subject Classiication (1991): 03B15 Mathematical logic and foundations]: Higher-order logic and type theory; 03B35 Mathematical logic and foundations]: Mechanization of proofs and logical operations; 68Q22 Com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 20 شماره
صفحات -
تاریخ انتشار 1999